منابع مشابه
Finitely Bounded Effective Computability
One of the most important property of the computability is the certainty. For example a set of natural numbers is computable if there is a Turing machine which decides certainly if a given natural number belongs to the set or not, and no wrong answers are tolerant. On the other hand, the finitely bounded computability discussed in this paper allows finitely many mistakes which can be eventually...
متن کاملAn Effective Characterization of Computability in Anonymous Networks
We provide effective (i.e., recursive) characterizations of the relations that can be computed on networks where all processors use the same algorithm, start from the same state, and know at least a bound on the network size. Three activation models are considered (synchronous, asynchronous, interleaved).
متن کاملTimothy Melvin COMPUTABILITY AND HUMAN SYMBOLIC OUTPUT
This paper concerns “human symbolic output,” or strings of characters produced by humans in our various symbolic systems; e.g., sentences in a natural language, mathematical propositions, and so on. One can form a set that consists of all of the strings of characters that have been produced by at least one human up to any given moment in human history. We argue that at any particular moment in ...
متن کاملL1-Computability, Layerwise Computability and Solovay Reducibility
We propose a hierarchy of classes of functions that corresponds to the hierarchy of randomness notions. Each class of functions converges at the corresponding random points. We give various characterizations of the classes, that is, characterizations via integral tests, L-computability and layerwise computability. Furthermore, the relation among these classes is formulated using a version of So...
متن کاملComputability versus exact computability of martingales
This note gives a simple example of a polynomial time computable martingale that has rational values but is not exactly computable.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Philosophia Mathematica
سال: 2018
ISSN: 0031-8019,1744-6406
DOI: 10.1093/philmat/nky011